Object Completion usingk-Sparse Optimization
نویسندگان
چکیده
منابع مشابه
Object Completion using k-Sparse Optimization
We present a new method for the completion of partial globally-symmetric 3D objects, based on the detection of partial and approximate symmetries in the incomplete input dataset. In our approach, symmetry detection is formulated as a constrained sparsity maximization problem, which is solved efficiently using a robust RANSACbased optimizer. The detected partial symmetries are then reused iterat...
متن کاملRestricted completion of sparse partial Latin squares
An n× n partial Latin square P is called α-dense if each row and column has at most αn non-empty cells and each symbol occurs at most αn times in P . An n× n array A where each cell contains a subset of {1, . . . , n} is a (βn, βn, βn)-array if each symbol occurs at most βn times in each row and column and each cell contains a set of size at most βn. Combining the notions of completing partial ...
متن کاملPreprocessing sparse semidefinite programs via matrix completion
Considering that preprocessing is an important phase in linear programming, it should be systematically more incorporated in semidefinite programming solvers. The conversion method proposed by the authors (SIAM Journal on Optimization, vol. 11, pp. 647–674, 2000, and Mathematical Programming, Series B, vol. 95, pp. 303–327, 2003) is a preprocessing of sparse semidefinite programs based on matri...
متن کاملHigh-order Tensor Completion for Data Recovery via Sparse Tensor-train Optimization
In this paper, we aim at the problem of tensor data completion. Tensor-train decomposition is adopted because of its powerful representation ability and linear scalability to tensor order. We propose an algorithm named Sparse Tensortrain Optimization (STTO) which considers incomplete data as sparse tensor and uses first-order optimization method to find the factors of tensor-train decomposition...
متن کاملVideo Completion Using Global Optimization
Video completion is a computer vision technique to restore the holes in video sequences due to removal of the dynamic or static foreground object by filling the unknown region with the known information. In this paper, a novel algorithm for video completion of large holes in video sequences is proposed. Video completion is treated as a global optimization problem by enforcing the spatial-tempor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2015
ISSN: 0167-7055
DOI: 10.1111/cgf.12741